Efficient Person Search: An Anchor-Free Approach

نویسندگان

چکیده

Person search aims to simultaneously localize and identify a query person from uncropped images. To achieve this goal, state-of-the-art models typically add re-id branch upon two-stage detectors like Faster R-CNN. Owing the ROI-Align operation, pipeline yields promising accuracy as features are explicitly aligned with corresponding object regions, but in meantime, it introduces high computational overhead due dense anchors. In work, we present an anchor-free approach efficiently tackling challenging task, by introducing following dedicated designs. First, select detector (i.e., FCOS) prototype of our framework. Due lack anchors, exhibits significantly higher efficiency compared existing models. Second, when directly accommodating for search, there exist several misalignment issues different levels scale, region, task). address these issues, propose feature aggregation module generate more discriminative robust embeddings. Accordingly, name framework Feature-Aligned Search Network (AlignPS). Third, investigating advantages both anchor-based models, further augment AlignPS head, which improves robustness while still keeping model highly efficient. Our not only achieves or competitive performance on two benchmarks, can be also extended other searching tasks such animal search. All source codes, data, trained available at: https://github.com/daodaofr/alignps .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AN EFFICIENT CHARGED SYSTEM SEARCH USING CHAOS

The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...

متن کامل

An Efficient Web Search Engine for Noisy Free Information Retrieval

The vast growth, various dynamic and low quality of the World Wide Web makes it very difficult to retrieve relevant information from internet during query search. To resolve this issue, various web mining techniques are being used. The biggest challenge in web mining is to remove noisy data information or unwanted information from the webpage such as banner, video, audio, images, hyperlinks etc...

متن کامل

An efficient approach for solving layout problems

This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...

متن کامل

FUZZY GRAVITATIONAL SEARCH ALGORITHM AN APPROACH FOR DATA MINING

The concept of intelligently controlling the search process of gravitational search algorithm (GSA) is introduced to develop a novel data mining technique. The proposed method is called fuzzy GSA miner (FGSA-miner). At first a fuzzy controller is designed for adaptively controlling the gravitational coefficient and the number of effective objects, as two important parameters which play major ro...

متن کامل

An Efficient Probabilistic Approach for Graph Similarity Search

Graph similarity search is a common and fundamental operation in graph databases. One of the most popular graph similarity measures is the Graph Edit Distance (GED) mainly because of its broad applicability and high interpretability. Despite its prevalence, exact GED computation is proved to be NP-hard, which could result in unsatisfactory computational efficiency on large graphs. However, exac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Vision

سال: 2023

ISSN: ['0920-5691', '1573-1405']

DOI: https://doi.org/10.1007/s11263-023-01772-3